On Consistency in Pairwise Comparisons Based Numerical and Non-Numerical Ranking
نویسندگان
چکیده
We extend the consistency rules to make them complete and present an automatically enforced “consistency”algorithm for the non-numerical ranking method based on the pairwise comparisons.
منابع مشابه
Preserving Consistency and Properties in Pairwise Comparisons Based Non-Numerical Ranking
We discuss property-driven non-numerical ranking by rough set partial order approximations and present property-consistency driven algorithm for the non-numerical ranking based on the pairwise comparisons.
متن کاملA weak order solution to a group ranking and consistency-driven pairwise comparisons
A novel non-numerical algorithm, based on a partial order, for solving a group ranking problem is compared with the more traditional consistency-driven approach. Both approaches are based on the fundamental concept ofpairwise comparisons. Potential applications are discussed. © 1998 Elsevier Science Inc. All rights reserved.
متن کاملOn a pairwise comparison-based consistent non-numerical ranking
We discuss a consistent model of pairwise comparison-based non-numerical ranking. An algorithm that enforces consistency for raw or partially organized ranking data is presented and its properties are analysed. The concept of testing subjective rankings is also discussed.
متن کاملRanking with Partial Orders and Pairwise Comparisons
A new approach to Pairwise Comparisons based Ranking is presented. An abstract model based on partial orders instead of numerical scales is introduced and analysed. The importance of the concept of indifference and the power of weak order extensions are discussed.
متن کاملApproximate Ranking from Pairwise Comparisons
A common problem in machine learning is to rank a set of n items based on pairwise comparisons. Here ranking refers to partitioning the items into sets of pre-specified sizes according to their scores, which includes identification of the top-k items as the most prominent special case. The score of a given item is defined as the probability that it beats a randomly chosen other item. Finding an...
متن کامل